Characteristic exponents of complex networks
نویسندگان
چکیده
We present a novel way to characterize the structure of complex networks by studying the statistical properties of the trajectories of random walks over them. We consider time series corresponding to different properties of the nodes visited by the walkers. We show that the analysis of the fluctuations of these time series allows to define a set of characteristic exponents which capture the local and global organization of a network. This approach provides a way of solving two classical problems in network science, namely the systematic classification of networks, and the identification of the salient properties of growing networks. The results contribute to the construction of a unifying framework for the investigation of the structure and dynamics of complex systems.
منابع مشابه
On isomorphism of two bases in Morrey-Lebesgue type spaces
Double system of exponents with complex-valued coefficients is considered. Under some conditions on the coefficients, we prove that if this system forms a basis for the Morrey-Lebesgue type space on $left[-pi , pi right]$, then it is isomorphic to the classical system of exponents in this space.
متن کاملExponents for B-stable Ideals
Let G be a simple algebraic group over the complex numbers containing a Borel subgroup B. Given a B-stable ideal I in the nilradical of the Lie algebra of B, we define natural numbers m1,m2, . . . ,mk which we call ideal exponents. We then propose two conjectures where these exponents arise, proving these conjectures in types An, Bn, Cn and some other types. When I = 0, we recover the usual exp...
متن کاملCore percolation on complex networks
We analytically solve the core percolation problem for complex networks with arbitrary degree distributions. We find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is continuous while for directed networks it is discontinuous (and hybrid) if the in- and out-degree distributions differ. We also find t...
متن کاملUnified view of scaling laws for river networks.
Scaling laws that describe the structure of river networks are shown to follow from three simple assumptions. These assumptions are (1) river networks are structurally self-similar, (2) single channels are self-affine, and (3) overland flow into channels occurs over a characteristic distance (drainage density is uniform). We obtain a complete set of scaling relations connecting the exponents of...
متن کاملSynchronization for Complex Dynamic Networks with State and Coupling Time-Delays
This paper is concerned with the problem of synchronization for complex dynamic networks with state and coupling time-delays. Therefore, larger class and more complicated complex dynamic networks can be considered for the synchronization problem. Based on the Lyapunov-Krasovskii functional, a delay-independent criterion is obtained and formulated in the form of linear matrix inequalities (LMIs)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1306.3808 شماره
صفحات -
تاریخ انتشار 2013